Irregular Applications in Promoter (preprint)

Parallel computers with distributed memory are gaining popularity on account of their optimal scala-bility. However, their eecient use requires a locality-preserving mapping of the application's underlying logical graph structure onto the physical topology of the target platform. There are several possible ways to achieve this. PROMOTER is a parallel programming model which attempts this by making the logical graph structures explicit and thus processable by the implementation. This article describes how this is done for applications with irregular and dynamic spatial structures .